# CX Postfix Generator
#### Vincent Paul F. Fiestada - 201369155
#### Project Repository: cxpostfixgen.codeplex.com

This is my *Machine Project 1* for my *CS 32 class* in the _University of the Philippines Diliman_
What follows is the specs given by our instructor *_Mr. Benj Del Mundo_*:

"For reference on the background of the problem, please refer to pages 90 to 97 of our main text. You are to implement the POLISH (and FINDRANK) algorithm as indicated in page 97 of the book using C as the programming language. Use the table indicated in page 94 to determine prioritization of tokens. As an additional requirement, you are to implement your own version of a linked stack to be used in the aforementioned algorithm.
...
"Your program will get the input from a file named infix.txt.  The contents of a file will be the infix form of the expression to be converted. The first line is an integer containing the number of expressions to be converted. The succeeding lines are the expressions that needed to be converted to postfix form. The operands are represented by a letter or a single digit. Each expression has maximum of 100 characters. 
"For the output: Print the postfix expressions on the screen separated by a new line 
If the postfix expression is not well formed, print “NOT WELL FORMED” after the postfix expression 
If the expression is invalid (invalid characters, missing parenthesis, missing file, contains spaces) print “Invalid expression”
...
##### Sample input: 
____________________________________________________
|infix.txt             | Screen                    |
|______________________|___________________________|       
|5 					   |                           |
|----------------------|---------------------------|
|(a+b-c/d+e^f^2) 	   | ab+cd/-ef2^^+             |
|----------------------|---------------------------|
|(a*(b+c/d)/e)         | abcd/+*e/                 |
|----------------------|---------------------------|
|(a*(b+(c-d)/e^2)+f)   | abcd-e2^/+*f+             |
|----------------------|---------------------------|
|(a++b)                | ab++ NOT WELL FORMED      |
|----------------------|---------------------------|
|@##%$#@#              | Invalid expression        |
|______________________|___________________________| 